Lexicographic Refinements in Possibilistic Decision Trees
نویسندگان
چکیده
Possibilistic decision theory has been proposed twenty years ago and has had several extensions since then. Because of the lack of decision power of possibilistic decision theory, several refinements have then been proposed. Unfortunately, these refinements do not allow to circumvent the difficulty when the decision problem is sequential. In this article, we propose to extend lexicographic refinements to possibilistic decision trees. We show, in particular, that they still benefit from an Expected Utility (EU) grounding. We also provide qualitative dynamic programming algorithms to compute lexicographic optimal strategies. The paper is completed with an experimental study that shows the feasibility and the interest of the approach.
منابع مشابه
Open Archive TOULOUSE Archive Ouverte (OATAO)
Possibilistic decision theory has been proposed twenty years ago and has had several extensions since then. Because of the lack of decision power of possibilistic decision theory, several refinements have then been proposed. Unfortunately, these refinements do not allow to circumvent the difficulty when the decision problem is sequential. In this article, we propose to extend lexicographic refi...
متن کاملLexicographic Refinements in the Context of Possibilistic Decision Theory
In Possibilistic Decision Theory (PDT), decisions are ranked by a pessimistic and an optimistic qualitative criteria. The preference relations induced by these criteria have been axiomatized by corresponding sets of rationality postulates, both à la Neumann-Morgenstern and à la Savage. In this paper we first address a particular issue regarding the axiomatic systems of PDT à la von Neumann and ...
متن کاملLexicographic Combinations of Preference Relations in the Context of Possibilistic Decision Theory
In Possibilistic Decision Theory (PDT), decisions are ranked by a pessimistic or by an optimistic qualitative criteria. The preference relations induced by these criteria have been axiomatized by corresponding sets of rationality postulates, both à la Von Neumann and Morgenstern and à la Savage. In this paper we first address a particular issue regarding the axiomatic systems of PDT à la Von Ne...
متن کاملReasoning with Preference Trees over Combinatorial Domains
Preference trees, or P-trees for short, offer an intuitive and often concise way of representing preferences over combinatorial domains. In this paper, we propose an alternative definition of P-trees, and formally introduce their compact representation that exploits occurrences of identical subtrees. We show that P-trees generalize lexicographic preference trees and are strictly more expressive...
متن کاملEfficient Policies for Stationary Possibilistic Markov Decision Processes
Possibilistic Markov Decision Processes offer a compact and tractable way to represent and solve problems of sequential decision under qualitative uncertainty. Even though appealing for its ability to handle qualitative problems, this model suffers from the drowning effect that is inherent to possibilistic decision theory. The present paper proposes to escape the drowning effect by extending to...
متن کامل